/*
 *  E.cxx
 *
 * 	Author : Pallab
 * 	Created on: 3:43:36 AM - 2012:12:20
 * 	"I have not failed, I have just found 10000 ways that won't work."
 */
#include <iostream>
#include <algorithm>
#include <vector>
#include <sstream>
#include <fstream>
#include <string>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <numeric>
#include <stack>
#include <functional>
#include <bitset>
#include <iomanip>
#include <unordered_set>
#include <unordered_map>

#include <ctime>
#include <cassert>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <climits>
#include <cstring>
#include <cstdlib>

using namespace std;

#define foR(i1,st,ed) for(int i1 = st , j1 = ed ; i1 < j1 ; ++i1 )
#define fo(i1,ed) foR( i1 , 0 , ed )
#define foE(i1,st,ed) foR( i1, st, ed+1 )
#define foit(i, x) for (typeof((x).begin()) i = (x).begin(); i != (x).end(); i++)
#define bip system("pause")
#define Int long long
#define pb push_back
#define SZ(X) (int)(X).size()
#define LN(X) (int)(X).length()
#define mk make_pair
#define SET( ARRAY , VALUE ) memset( ARRAY , VALUE , sizeof(ARRAY) )
#define line puts("")

inline void wait ( double seconds ) {
    double endtime = clock() + ( seconds * CLOCKS_PER_SEC );
    while ( clock() < endtime ) {
        ;
    }
}
template<class T>
    inline T fastIn() {
    register char c=0;
    register T a=0;
    bool neg=false;
    while ( c<33 ) c=getchar();
    while ( c>33 ) {
        if ( c=='-' ) {
            neg=true;
        } else {
            a= ( a*10 ) + ( c-'0' );
        }
        c=getchar();
    }
    return neg?-a:a;
}



unordered_map<Int, Int> grundy;
inline int calc_grundy ( Int num ) {
    if ( grundy.count ( num ) >0 ) return grundy[num];
    Int from = ( Int ) ( pow ( ( double ) num,0.25 ) );
    Int to   = ( Int ) ( pow ( ( double ) num,0.50 ) );

    while ( from*from*from*from<num ) ++from;
    while ( to*to>num )--to;

    Int retval=0;
    unordered_set<Int> mex;
    if ( to<num&&from<=to ) {
        for ( int i=from; i<=to; ++i ) {
            if ( grundy.count ( i ) > 0 ) {
                mex.insert ( grundy[i] );
            } else {
                mex.insert ( calc_grundy ( i ) );
            }
        }
        for ( int i=0; ; ++i ) {
            if ( mex.count ( i ) <1 ) {
                retval=i;
                break;
            }
        }
    }
    //cout<<num<<' '<<from<<' '<<to<<' '<<retval<<'\n';
    grundy[num]=retval;
    return retval;
}
int csum[881917+10][5];
int gi[881917+10];

inline int grundy_fast ( Int num ) {
    Int from = ( Int ) ( pow ( ( double ) num,0.25 ) );
    Int to   = ( Int ) ( pow ( ( double ) num,0.50 ) );

    while ( from*from*from*from<num ) ++from;
    while ( to*to>num )--to;

    Int retval=0;
    if ( to<num&&from<=to ) {
        for ( int i=0; i<5; ++i ) if ( csum[to][i]==csum[from-1][i] ) {
                retval=i;
                break;
            }
    }
    return retval;
}
inline void simulate() {
    //for(int i=0;i<=881917;++i)calc_grundy(i);
    //12.801 sec
    SET ( csum,0 );
    for ( int i=2; i<=881918; ++i ) {
        memcpy ( csum[i],csum[i-1],sizeof csum[i-1] );
        gi[i]=grundy_fast ( i );
        csum[ i ][ gi[i] ]++;
        //cout<<i<<' '<<gi[i]<<' '<<calc_grundy(i)<<'\n';
    }
}
//881917+1
const int MX=77777+5;
Int num[MX];
int num_count;
inline void read() {
    num_count=fastIn<int>();
    fo ( i,num_count ) num[i]=fastIn<Int>();
}
inline void proc() {
    //simulate();
    SET ( csum,0 );
    for ( int i=2; i<=881918; ++i ) {
        memcpy ( csum[i],csum[i-1],sizeof csum[i-1] );
        gi[i]=grundy_fast ( i );
        csum[ i ][ gi[i] ]++;
        //cout<<i<<' '<<gi[i]<<' '<<calc_grundy(i)<<'\n';
    }

    int retval=0LL;
    fo ( i,num_count ) retval^= grundy_fast ( num[i] );

    puts ( ( retval? "Furlo" : "Rublo" ) );
}
int main() {
    int kase = 1;
#if defined( xerxes_pc )
    if ( !freopen ( "in1", "r", stdin ) )
        puts ( "error opening file in " ), assert ( 0 );
    kase = 3;
#endif

    foE ( i,1,kase ) {
        read();
        proc();
    }
    return 0;
}

// kate: indent-mode cstyle; indent-width 4; replace-tabs on; 
